Markov semigroups, monoids, and groups

نویسندگان

  • Alan J. Cain
  • Victor Maltcev
چکیده

A group is Markov if it admits a prefix-closed regular language of unique representatives with respect to some generating set, and strongly Markov if it admits such a language of unique minimal-length representatives over every generating set. This paper considers the natural generalizations of these concepts to semigroups and monoids. Two distinct potential generalizations to monoids are shown to be equivalent. Various interesting examples are presented, including an example of a non-Markov monoid that nevertheless admits a regular language of unique representatives over any generating set. It is shown that all finitely generated commutative semigroups are strongly Markov, but that finitely generated subsemigroups of virtually abelian or polycyclic groups need not be. Potential connections with wordhyperbolic semigroups are investigated. A study is made of the interaction of the classes of Markov and strongly Markov semigroups with direct products, free products, and finite-index subsemigroups and extensions. Several questions are posed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decision Problems for Finitely Presented and One-Relation Semigroups and Monoids

For some distinguished properties of semigroups, such as having idempotents, regularity, hopficity etc, we study the following: whether that property or its negation is a Markov property, whether it is decidable for finitely presented semigroups and for one-relation semigroups and monoids. All the results and open problems are summarized in a table.

متن کامل

Partial symmetry, reflection monoids and Coxeter groups

This is the first of a series of papers in which we initiate and develop the theory of reflection monoids, motivated by the theory of reflection groups. The main results identify a number of important inverse semigroups as reflection monoids, introduce new examples, and determine their orders.

متن کامل

The Semigroup Efficiency of Groups and Monoids

A nite semigroup (respectively monoid or group) S is said to be eecient if it can be deened by a semigroup (respectively monoid or group) presentation hA jRi with jRj ? jAj = rank(H 2 (S 1)). In this paper we show that a group is eecient as a group if and only if it is eecient as a monoid, but some eecient monoids are not eecient as semigroups. Moreover we show that certain classes of eecient g...

متن کامل

The Structure of Endomorphism monoids of Strong semilattices of left simple semigroups

Endomorphism monoids have long been of interest in universal algebra and also in the study of particular classes of algebraic structures. For any algebra, the set of endomorphisms is closed under composition and forms a monoid (that is, a semigroup with identity). The endomorphism monoid is an interesting structure from a given algebra. In this thesis we study the structure and properties of th...

متن کامل

Automatic semigroups vs automaton semigroups

We develop an effective and natural approach to interpret any semigroup admitting a special language of greedy normal forms as an automaton semigroup, namely the semigroup generated by a Mealy automaton encoding the behaviour of such a language of greedy normal forms under one-sided multiplication. The framework embraces many of the well-known classes of (automatic) semigroups: free semigroups,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IJAC

دوره 24  شماره 

صفحات  -

تاریخ انتشار 2014